Every locally connected functionally Hausdorff space is c-resolvable

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Every crowded pseudocompact ccc space is resolvable

We prove that every pseudocompact crowed ccc space is c-resolvable. This gives a partial answer to problems posed by Comfort and Garćıa-Ferriera, and Juhász, Soukup and Szentmiklóssy.

متن کامل

Every Hausdorff Compactification of a Locally Compact Separable Space Is a Ga Compactification

1. I n t r o d u c t i o n . In [4], De Groot and Aarts constructed Hausdorff compactifications of topological spaces to obtain a new intrinsic characterization of complete regularity. These compactifications were called GA compactifications in [5] and [7]. A characterization of complete regularity was earlier given by Fr ink [3], by means of Wallman compactifications, a method which led to the...

متن کامل

Every Monotone Open 2-homogeneous Metric Continuum Is Locally Connected

In [16, Theorem 3.12, p. 397], Ungar answered a question of Burgess [2] by showing that every 2-homogeneous metric continuum is locally connected. A short, elementary and elegant proof of this result has been given by Whittington [17] who has omitted a powerful result of Effros (viz. Theorem 2.1 of [4, p. 39]) used by Ungar. It is observed in this note that Whittington's proof can be applied to...

متن کامل

Every 3-connected, locally connected, claw-free graph is Hamilton-connected

A graph G is locally connected if the subgraph induced by the neighbourhood of each vertex is connected. We prove that a locally connected graph G of order p 3, containing no induced subgraph isomorphic to K 1;3 , is Hamilton-connected if and only if G is 3-connected.

متن کامل

Every N2-Locally Connected claw-Free Graph with Minimum Degree at Least 7 is Z3-Connected

Let G be a 2-edge-connected undirected graph, A be an (additive) abelian group and A∗ = A−{0}. A graph G is A-connected if G has an orientation D(G) such that for every function b : V (G) 7→ A satisfying ∑ v∈V (G) b(v) = 0, there is a function f : E(G) 7→ A ∗ such that for each vertex v ∈ V (G), the total amount of f values on the edges directed out from v minus the total amount of f values on ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Topology and its Applications

سال: 2015

ISSN: 0166-8641

DOI: 10.1016/j.topol.2015.01.007